On partial randomness
نویسندگان
چکیده
منابع مشابه
On partial randomness
If x = x1x2 · · ·xn · · · is a random sequence, then the sequence y = 0x10x2 · · · 0xn · · · is clearly not random; however, y seems to be “about half random”. Staiger [14, 15] and Tadaki [16] have studied the degree of randomness of sequences or reals by measuring their “degree of compression”. This line of study leads to various definitions of partial randomness. In this paper we explore some...
متن کاملFixed Points on Partial Randomness
Algorithmic information theory (AIT, for short) is a theory of program-size and algorithmic randomness. One of the primary concepts of AIT is the Kolmogorov complexity K(s) of a finite binary string s, which is defined as the length of the shortest binary program for a universal decoding algorithm to output s. In this paper, we report on a quite new type of fixed point in computer science, call...
متن کاملFixed Point Theorems on Partial Randomness
In our former work [K. Tadaki, Local Proceedings of CiE 2008, pp. 425–434, 2008], we developed a statistical mechanical interpretation of algorithmic information theory by introducing the notion of thermodynamic quantities at temperature T , such as free energy F (T ), energy E(T ), and statistical mechanical entropy S(T ), into the theory. These quantities are real functions of real argument T...
متن کاملPropagation of partial randomness
Let f be a computable function from finite sequences of 0’s and 1’s to real numbers. We prove that strong f -randomness implies strong f randomness relative to a PA-degree. We also prove: if X is strongly f -random and Turing reducible to Y where Y is Martin-Löf random relative to Z, then X is strongly f -random relative to Z. In addition, we prove analogous propagation results for other notion...
متن کاملRandomness notions and partial relativization
We study weak 2 randomness, weak randomness relative to ∅′ and Schnorr randomness relative to ∅′. One major theme is characterizing the oracles A such that ML[A] ⊆ C, where C is a randomness notion and ML[A] denotes the Martin-Löf random reals relative to A. We discuss the connections with LR-reducibility and also study the reducibility associated with weak 2randomness.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2006
ISSN: 0168-0072
DOI: 10.1016/j.apal.2005.06.004